180 research outputs found

    Hypothesis Testing in Feedforward Networks with Broadcast Failures

    Full text link
    Consider a countably infinite set of nodes, which sequentially make decisions between two given hypotheses. Each node takes a measurement of the underlying truth, observes the decisions from some immediate predecessors, and makes a decision between the given hypotheses. We consider two classes of broadcast failures: 1) each node broadcasts a decision to the other nodes, subject to random erasure in the form of a binary erasure channel; 2) each node broadcasts a randomly flipped decision to the other nodes in the form of a binary symmetric channel. We are interested in whether there exists a decision strategy consisting of a sequence of likelihood ratio tests such that the node decisions converge in probability to the underlying truth. In both cases, we show that if each node only learns from a bounded number of immediate predecessors, then there does not exist a decision strategy such that the decisions converge in probability to the underlying truth. However, in case 1, we show that if each node learns from an unboundedly growing number of predecessors, then the decisions converge in probability to the underlying truth, even when the erasure probabilities converge to 1. We also derive the convergence rate of the error probability. In case 2, we show that if each node learns from all of its previous predecessors, then the decisions converge in probability to the underlying truth when the flipping probabilities of the binary symmetric channels are bounded away from 1/2. In the case where the flipping probabilities converge to 1/2, we derive a necessary condition on the convergence rate of the flipping probabilities such that the decisions still converge to the underlying truth. We also explicitly characterize the relationship between the convergence rate of the error probability and the convergence rate of the flipping probabilities

    Inhomogeneous Diophantine approximation over fields of formal power series

    Full text link
    We prove a sharp analogue of Minkowski's inhomogeneous approximation theorem over fields of power series Fq((Tβˆ’1))\mathbb{F}_q((T^{-1})). Furthermore, we study the approximation to a given point yβ€Ύ\underline{y} in Fq((Tβˆ’1))2\mathbb{F}_q((T^{-1}))^2 by the SL2(Fq[T])SL_2(\mathbb{F}_q[T])-orbit of a given point xβ€Ύ\underline{x} in Fq((Tβˆ’1))2\mathbb{F}_q((T^{-1}))^2.Comment: 22 page
    • …
    corecore